Elliptic Curves
نویسنده
چکیده
This book is about elliptic curves and modular functions, two topics that are intimately related in both accidental and essential ways. As emphasized by André Weil in his magisterial historical introduction to contemporary number theory [W], the arithmetic study of elliptic curves is, in spite of the clear reference to the integral calculus in the adjective elliptic, in many respects antecedent to the geometric and analytic study, and at least as important. There is still today hardly a domain of mathematics in which elliptic integrals or elliptic functions do not appear, and although we have far more questions about the arithmetic of elliptic curves than Fermat, we do not have many more answers.∗ Speculation about links between them and other subjects, appealing though it be, has nevertheless to be examined with circumspection, even when it is taken seriously.
منابع مشابه
Complete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملOn the rank of certain parametrized elliptic curves
In this paper the family of elliptic curves over Q given by the equation Ep :Y2 = (X - p)3 + X3 + (X + p)3 where p is a prime number, is studied. Itis shown that the maximal rank of the elliptic curves is at most 3 and someconditions under which we have rank(Ep(Q)) = 0 or rank(Ep(Q)) = 1 orrank(Ep(Q))≥2 are given.
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملOn the Elliptic Curves of the Form $y^2 = x^3 − pqx$
By the Mordell- Weil theorem, the group of rational points on an elliptic curve over a number field is a finitely generated abelian group. This paper studies the rank of the family Epq:y2=x3-pqx of elliptic curves, where p and q are distinct primes. We give infinite families of elliptic curves of the form y2=x3-pqx with rank two, three and four, assuming a conjecture of Schinzel ...
متن کاملOn the elliptic curves of the form $ y^2=x^3-3px $
By the Mordell-Weil theorem, the group of rational points on an elliptic curve over a number field is a finitely generated abelian group. There is no known algorithm for finding the rank of this group. This paper computes the rank of the family $ E_p:y^2=x^3-3px $ of elliptic curves, where p is a prime.
متن کامل